Spanning tree - PDFSEARCH.IO - Document Search Engine

Spanning tree
Results: 445

#	Item
231	syn_scale_density_query_time.eps Add to Reading List Source URL: www.vldb.org Language: English - Date: 2013-10-10 12:39:02 Morphisms Line graph Graph isomorphism Graph Connected component Tree Spanning tree Matching Graph coloring Graph theory Mathematics Graph operations
232	An Infrastructure for Profile-Driven Dynamic Recompilation∗ Robert G. Burger R. Kent Dybvig Indiana University Computer Science Department Add to Reading List Source URL: www.cs.indiana.edu Language: English - Date: 2004-05-15 18:22:50 Compiler construction Procedural programming languages Spanning tree Pointer Minimum spanning tree Dynamic recompilation Control flow Fortran C Computing Software engineering Computer programming
233	Solutions to Homework Eight CSE[removed]a) The formula has two satisfying assignments, (x1 , x2 , x3 , x4 ) = (true, false, false, true) and (true, true, false, true). Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2014-11-25 12:57:39 Mathematics Applied mathematics GEC COMPASS/Sample Code Minimum spanning tree Spanning tree Theoretical computer science
234	Knisley and Knisley BMC Proceedings 2014, 8(Suppl 2):S7 http://www.biomedcentral.com[removed]S2/S7 RESEARCH Open Access Add to Reading List Source URL: www.biomedcentral.com Language: English Minimum spanning tree Path Graph Vertex Degree Graph operations Line graph Clique Graph theory Graph connectivity Spanning tree
235	All closest neighbors are proper Delaunay edges generalized, and its application to parallel algorithms Arne Maus Jon Moen Drange {arnem,[removed]} Add to Reading List Source URL: www.nik.no Language: English - Date: 2010-10-01 06:27:48 Delaunay triangulation Gabriel graph Proximity problems Pitteway triangulation Euclidean minimum spanning tree Triangulation Geometry Mathematics
236	tunning_parameter_running_time_machine_number.eps Add to Reading List Source URL: www.vldb.org Language: English - Date: 2014-11-12 16:57:53 NP-complete problems Network theory Graph coloring Graph partition Shortest path problem Connectivity Minimum spanning tree Breadth-first search Theoretical computer science Graph theory Mathematics
237	Retrieving Regions of Interest for User Exploration Xin Cao1 1 Gao Cong1 Add to Reading List Source URL: www.vldb.org Language: English - Date: 2014-04-05 17:13:23 Theoretical computer science Combinatorial optimization Routing algorithms Minimum spanning tree Spanning tree Dynamic programming Breadth-first search A* search algorithm Tree Search algorithms Mathematics Graph theory
238	Influential Community Search in Large Networks Rong-Hua Li† , Lu Qin‡ , Jeffrey Xu Yu∗ , and Rui Mao† † Guangdong Province Key Laboratory of Popular High Performance Computers, Shenzhen University, China ‡ Add to Reading List Source URL: www.vldb.org Language: English - Date: 2014-12-17 10:03:05 Search algorithms Degeneracy Tree Connectivity Depth-first search Degree NP-complete problems Spanning tree Graph coloring Graph theory Mathematics Theoretical computer science
239	Finding the k Shortest Paths David Eppstein∗ March 31, 1997 Abstract We give algorithms for finding the k shortest paths (not required to be simple) connecting a Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 1998-09-22 19:03:25 Network theory Routing algorithms Graph connectivity Combinatorial optimization Shortest path problem Minimum spanning tree Tree Path graph Matching Graph theory Mathematics Theoretical computer science
240	Algorithm S LOW C ONVEX H ULL(P) Input. A set P of points in the plane. Output. A list L containing the vertices of CH(P) in clockwise order. 1. E ← [removed]for all ordered pairs (p, q) ∈ P × P with p not equal to q Add to Reading List Source URL: www.cs.uu.nl Language: English - Date: 2008-02-13 10:13:47 Computational geometry Spanning tree Mathematics

UPDATE